Periodic review inventory management with contingent use of two freight modes with fixed costs

We study a stochastic inventory model of a firm that periodically orders a product from a make‐to‐order manufacturer. Orders can be shipped by a combination of two freight modes that differ in lead‐times and costs, although orders are not allowed to cross. Placing an order as well as each use of each freight mode has a fixed and a quantity proportional cost. The decision of how to allocate units between the two freight modes utilizes information about demand during the completion of manufacturing. We derive the optimal freight mode allocation policy, and show that the optimal policy for placing orders is not an (s,S) policy in general. We provide tight bounds for the optimal policy that can be calculated by solving single period problems. Our analysis enables insights into the structure of the optimal policy specifying the conditions under which it simplifies to an (s,S) policy. We characterize the best (s,S) policy for our model, and through extensive numerical investigation show that its performance is comparable with the optimal policy in most cases. Our numerical study also sheds light on the benefits of the dual freight model over the single freight models. © 2011 Wiley Periodicals, Inc. Naval Research Logistics, 2011     

基于层次分析法的桂西北古村寨火灾风险评估研究

应用层次分析法,根据桂西北古村寨的实际情况,建立了桂西北古村寨的火灾风险评估体系。采用专家打分法获取数据,并应用统计学中的众值原理,对获得的数据进行了统计,得到了指标的权重,建立了适用于实际情况的消防安全检查表。并应用实例证明了这种评估方法行之有效。     

基于聚类算法的多无人机系统任务分配

针对现有任务分配方法在任务点较多时不易解算,且计算量大的问题,提出了基于模糊C-均值聚类算法的多无人机系统任务分配方法.首先,利用模糊C-均值聚类算法得到的隶属度矩阵对任务点进行初始分配;其次,针对基于空间划分聚类可能造成各UAV任务不均衡的问题,设计任务的局部优化调整规则;最后,结合单旅行商问题,利用Tabu Sea...     

Quantifying the performance effects of idle time utilization in multiserver systems

In many practical multiserver queueing systems, servers not only serve randomly arriving customers but also work on the secondary jobs with infinite backlog during their idle time. In this paper, we propose a c‐server model with a two‐threshold policy, denoted by (e d), to evaluate the performance of this class of systems. With such a policy, when the number of idle servers has reached d (<c), then e (<d) idle agents will process secondary jobs. These e servers keep working on the secondary jobs until they find waiting customers exist in the system at a secondary job completion instant. Using the matrix analytic method, we obtain the stationary performance measures for evaluating different (e, d) policies. © 2006 Wiley Periodicals, Inc. Naval Research Logistics, 2007.     

基于扩展Petri网的动态服务聚合流程描述模型及其BPEL4WS表示方法

针对现有服务聚合流程建模方法的不足,基于扩展Petri网提出了一种新的服务聚合流程/资源描述模型WSCP/R-net,有效解决了动态服务聚合流程模型中不确定路径选择和服务的动态变化性问题。给出了WSCP/R-net模型向BPEL4WS的转换算法,并以城市应急处理为例说明了转换算法的有效性。     

Managing components for assemble‐to‐order products with lead‐time‐dependent pricing: The full‐shipment model

We study a component inventory planning problem in an assemble‐to‐order environment faced by many contract manufacturers in which both quick delivery and efficient management of component inventory are crucial for the manufacturers to achieve profitability in a highly competitive market. Extending a recent study in a similar problem setting by the same authors, we analyze an optimization model for determining the optimal component stocking decision for a contract manufacturer facing an uncertain future demand, where product price depends on the delivery times. In contrast to our earlier work, this paper considers the situation where the contract manufacturer needs to deliver the full order quantity in one single shipment. This delivery requirement is appropriate for many industries, such as the garment and toy industries, where the economies of scale in transportation is essential. We develop efficient solution procedures for solving this optimization problem. We use our model results to illustrate how the different model parameters affect the optimal solution. We also compare the results under this full‐shipment model with those from our earlier work that allows for multiple partial shipments. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007     

软件构件可靠性与费用分配最优模型

针对软件构件可靠性和费用分配问题,给出一种可靠性和费用分配最优模型。文中将软件系统可靠性定义为软件构件失效密度、操作剖面、构件使用矩阵以及软件无失效运行时间的函数,描述了费用最优模型的建立和利用非线性规划理论求解模型的步骤,有效地处理了带有复杂计算的目标函数和约束条件的可靠性和费用最优分配问题。计算实例表明,利用该模型进行可靠性和费用分配是可行的。     

一种视差域基于学习方法的图像合成算法

基于图像序列的图像合成往往需要定标和恢复场景三维结构,为了避免这些复杂过程,根据参考图像的视点离虚拟视点的远近关系,将参考图像序列分为主、从参考图像,并利用多极约束的原理和非线性校正,将图像合成的最优化问题从深度域转化到视差域,从而在不定标和不匹配的情况下,直接从图像序列合成虚拟视图。实验结果证明算法是有效的,并有一定的应用前景。     

动基站时差探测系统定位方法研究

针对传统长基线时差探测系统的缺点,提出了全新的动基站时差测量系统并给出了目标的定位原理。在典型布站、信息存在冗余的前提下,通过子集选优法确定了最佳定位算法,并根据工程应用的需要确定了更加合理简捷的定位算法,统计仿真表明了该算法的有效性。最后,计算了目标高度测量精度并归纳了其特点,给出了有益的结论。     

The minmax multidimensional knapsack problem with application to a chance‐constrained problem

In this paper we present a new combinatorial problem, called minmax multidimensional knapsack problem (MKP), motivated by a military logistics problem. The logistics problem is a two‐period, two‐level, chance‐constrained problem with recourse. We show that the MKP is NP‐hard and develop a practically efficient combinatorial algorithm for solving it. We also show that under some reasonable assumptions regarding the operational setting of the logistics problem, the chance‐constrained optimization problem is decomposable into a series of MKPs that are solved separately. © 2007 Wiley Periodicals, Inc. Naval Research Logistics, 2007